Stowage and Transport Optimization in Ship Planning

نویسندگان

  • Dirk Steenken
  • Thomas Winter
  • Uwe T. Zimmermann
چکیده

We consider the ship planning problem at maritime container terminals where containers are loaded onto and discharged from ships using quay cranes. The container transport between the ships and the yard positions in the terminal is carried out by a fleet of straddle carriers. Based on a stowage plan provided by the shipping company, the dispatcher assigns containers to specified bay positions. Then, subject to operational and stability constraints, he schedules containers in order to avoid waiting times at the quay cranes. We propose an approach combining stowage planning and the selection of “good” loading and transport sequences. For a just-in-time scheduling model, we present computational results based on real-world data of a German container terminal. Moreover, we discuss some real-time and online influences on the daily dispatch situation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Optimization and Strategy for Ship Stowage and Loading Schedule of Container Terminal

In order to reduce the conflict of yard, vehicles and quay crane in the process of loading container, and upgrade safety of the ship stowage and transport economics, this paper took minimizing reshuffle times in yard and ship, minimizing the ship center of gravity, getting appropriate trim and minimizing the total moving distance of quay crane as optimization objectives to guarantee the balance...

متن کامل

On the complexity of container stowage planning problems

The optimization of container ship and depot operations embeds the k-shift problem, in which containers must be stowed in stacks such that at most k containers must be removed in order to reach containers below them. We first solve an open problem introduced by Avriel et al. (2000) by showing that changing from uncapacitated to capacitated stacks reduces the complexity of this problem from NP-c...

متن کامل

Solving the 3D Container Ship Loading Planning Problem by Representation by Rules and Beam Search

This paper formulates the 3D Container ship Loading Planning Problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. Containers on board a Container ship are placed in vertical stacks, located in different sections. The only way to access the containers is through the top of the stack. In order to unload a container at a given port j, it is necessary to rem...

متن کامل

A 3 D - BPP approach for optimising stowage plans and terminal productivity q

This paper addresses the problem of determining stowage plans for containers in a ship, that is the so-called master bay plan problem (MBPP). MBPP is NP-complete [Botter, R.C., Brinati, M.A., 1992. Stowage container planning: A model for getting an optimal solution. IFIP Transactions B (Applications in Technology) B-5, 217–229; Avriel, M., Penn, M., Shpirer, N., 2000. Container ship stowage pro...

متن کامل

Symbolic Configuration for Interactive Container Ship Stowage Planning

Low cost containerized shipping requires high-quality stowage plans. Scalable stowage planning optimization algorithms have been developed recently. All of these algorithms, however, produce monolithic solutions that are hard for stowage coordinators to modify, which is necessary in practice due to exceptions and operational disruptions. This article introduces an approach for modifying a stowa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001